A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem
نویسندگان
چکیده
We consider a general metric Steiner problem, which involves finding set S with the minimal length, such that S∪A is connected, where A given compact subset of complete space X; solution called tree. Paolini, Stepanov, and Teplitskaya in 2015 provided an example planar tree infinite number branching points connecting uncountable points. prove can have positive Hausdorff dimension, was open question (the corresponding exhibits self-similar fractal properties).
منابع مشابه
A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem
Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a selfstabilizing heuristic solution to the problem. Our algorithm is constructed by four layered modules (sub-algorithms): construction of a shortest path forest, transformation of the network, construction...
متن کاملA Logic-Based Approach to Solve the Steiner Tree Problem
Boolean satisfiability (SAT) is a well-studied N P-complete problem for formulating and solving other combinatorial problems like planning and scheduling. The Steiner tree problem (STP) asks to find a minimal cost tree in a graph that spans a set of nodes. STP has been shown to be N P-hard. In this paper, we propose to solve the STP by formulating it as a variation of SAT, and to solve it using...
متن کاملA Hybrid Approach to The Steiner Tree Problem in Graphs
The Steiner Tree Problem in graphs (SPG) is that of finding a minimum-length interconnection of a set of terminals/nodes, and has long been one of the fundamental problems in the field of electronic design automation especially in VLSI Chip Design(Mandoiu, Vazirani, Ganley, 2000) and Printed Circuit Board layout, where the routing efficiency (in terms of monetary considerations and minimum spac...
متن کاملThe full Steiner tree problem
Motivated by the reconstruction of phylogenetic tree in biology, we study the full Steiner tree problem in this paper. Given a complete graph G = (V; E) with a length function on E and a proper subset R ⊂ V , the problem is to 4nd a full Steiner tree of minimum length in G, which is a kind of Steiner tree with all the vertices of R as its leaves. In this paper, we show that this problem is NP-c...
متن کاملThe Steiner tree packing problem
In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we devel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fractal and fractional
سال: 2023
ISSN: ['2504-3110']
DOI: https://doi.org/10.3390/fractalfract7050414